Bit density based signal and jamming detection in 1-bit quantized MIMO systems

This paper studies the problem of deciding on absence (i.e., null hypothesis, H0) or presence alternative H1) an unknown signal embedded in received a multiple-input, multiple-output (MIMO) receiver, employing 1-bit quantization. The originality our solution lies quantizing by adapted window comparator, rather than traditional quantizer. enables us to divide space observed binary sequences into two typical sets (w.r.t. distribution no. 1's sequence) asymptotically, where first set corresponds H0 and second H1. As result, we reduce detection determining highly probable for sequence. Thus, very low-complexity hypothesis detector is proposed its probability given. To show high efficacy receiver structure, consider wireless applications; jamming massive MIMO system, probing non-stationary low-power transmitter sensor network (WSN), assuming Rayleigh-fading channels. Compared with unquantized system chi-square test, it shown that performance loss can be roughly as large 10% this gap diminishes sequence length or/and power increases. For WSN, compared becomes smaller when observation interval extended over few symbols.